منابع مشابه
Dynamically distinguishing polynomials
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: For any prime p, reduce its coefficients mod p and consider its action on the field Fp. We say a subset of Z[x] is dynamically distinguishable mod p if the associated mod p dynamical systems are pairwise non-isomorphic. For any k, M ∈ Z>1, we prove that there are infinitely many sets of int...
متن کاملOn the Complexity of Exact Counting of Dynamically Irreducible Polynomials
We give an efficient algorithm to enumerate all sets of r ě 1 quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملDistinguishing Bonds.
The energy change per electron in a chemical or physical transformation, ΔE/n, may be expressed as Δχ̅ + Δ(VNN + ω)/n, where Δχ̅ is the average electron binding energy, a generalized electronegativity, ΔVNN is the change in nuclear repulsions, and Δω is the change in multielectron interactions in the process considered. The last term can be obtained by the difference from experimental or theoreti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in the Mathematical Sciences
سال: 2017
ISSN: 2197-9847
DOI: 10.1186/s40687-017-0103-3